Holonification of a Network of Agents Based on Graph Theory

A multi-agent system consists of a group of interacting autonomous agents. The key problem in such a system is coordination and cooperation, i.e. how to ensure that individual decisions of the agents result in jointly optimal decisions for the overall system. This problem becomes even more serious when the number of the agents is large. Holonic model is an effective method to manage large scale problems. In holonic approaches, the formation of the initial holons is very critical and has a great influence on their performance and effectiveness. In this paper, we use a graph based modelling approach to group a population of agents with a greedy method, driven by a very simple and effective quality measure. The proposed method is evaluated by applying it to an urban traffic problem as a case study and it is shown the proposed method produces better results.